A classification of tightly attached half-arc-transitive graphs of valency 4

نویسنده

  • Primoz Sparl
چکیده

A graph is said to be half-arc-transitive if its automorphism group acts transitively on the set of its vertices and edges but not on the set of its arcs. With each half-arc-transitive graph of valency 4 a collection of the so called alternating cycles is associated, all of which have the same even length. Half of this length is called the radius of the graph in question. Moreover, any two adjacent alternating cycles have the same number of common vertices. If this number, the so called attachment number, coincides with the radius, we say that the graph is tightly attached. Marušič gave a classification of tightly attached half-arc-transitive graphs of valency 4 with odd radius. In this paper the even radius tightly attached graphs of valency 4 are classified, thus completing the classification of all tightly attached half-arc-transitive graphs of valency 4. 1 Introductory remarks Throughout this paper graphs are assumed to be finite and, unless stated otherwise, simple, connected and undirected. For group-theoretic concepts not defined here we refer the reader to [3, 8, 31], and for graph-theoretic terms not defined here we refer the reader to [4]. In this paper we let Z Z n denote the ring of residue classes modulo n and we let Z Z * n denote the set of invertible elements of Z Z n. At times it will be convenient to view elements of Z Z n as integers, for instance if ρ is an element of some group with ρ n = 1 and if r ∈ Z Z n , we let ρ r represent ρ k for any k in the equivalence class r. This should cause no confusion. For basic notation and other conventions see Section 2. Let X be a graph. We let V (X), E(X) and A(X) denote the set of vertices, edges and arcs of X, respectively. The graph X is said to be vertex-transitive, edge-transitive and arc-transitive provided that its automorphism group AutX acts transitively on the set of its vertices, edges and arcs, respectively. Moreover, X is said to be half-arc-transitive if it is vertex-and edge-but not arc-transitive. More generally, by a half-arc-transitive action of a subgroup G ≤ AutX on X we mean a vertex-and edge-but not arc-transitive action of G on X. In this case we say that X is G-half-arc-transitive. As demonstrated in [29, 7.53, p. 59] by Tutte, the …

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing even radius tightly attached half-arc-transitive graphs of valency four

A finite graph X is half-arc-transitive if its automorphism group is transitive on vertices and edges, but not on arcs. When X is tetravalent, the automorphism group induces an orientation on the edges and a cycle of X is called an alternating cycle if its consecutive edges in the cycle have opposite orientations. All alternating cycles of X have the same length and half of this length is calle...

متن کامل

Half-Transitive Group Actions on Finite Graphs of Valency 4

The action of a subgroup G of automorphisms of a graph X is said to be 2 -transitive if it is vertexand edgebut not arc-transitive. In this case the graph X is said to be (G, 2)-transitive. In particular, X is 1 2 -transitive if it is (Aut X, 1 2)-transitive. The 2 -transitive action of G on X induces an orientation of the edges of X which is preserved by G. Let X have valency 4. An even length...

متن کامل

Half-arc-transitive graphs of order 4p of valency twice a prime

A graph is half-arc-transitive if its automorphism group acts transitively on vertices and edges, but not on arcs. Let p be a prime. Cheng and Oxley [On weakly symmetric graphs of order twice a prime, J. Combin. Theory B 42(1987) 196-211] proved that there is no half-arc-transitive graph of order 2p, and Alspach and Xu [ 12 -transitive graphs of order 3p, J. Algebraic Combin. 3(1994) 347-355] c...

متن کامل

On quartic half-arc-transitive metacirculants

Following Alspach and Parsons, a metacirculant graph is a graph admitting a transitive group generated by two automorphisms ρ and σ , where ρ is (m,n)semiregular for some integers m ≥ 1, n ≥ 2, and where σ normalizes ρ, cyclically permuting the orbits of ρ in such a way that σ has at least one fixed vertex. A halfarc-transitive graph is a vertexand edgebut not arc-transitive graph. In this arti...

متن کامل

Maps, One-regular Graphs and Half-transitive Graphs of Valency 4

A subgroup G of automorphisms of a graph X is said to be 1 2-transitive if it is vertex and edge but not arc-transitive. The graph X is said to be 1 2-transitive if Aut X is 1 2-transitive. The graph X is called one-regular if Aut X acts regularly on the set arcs of X. The interplay of three diierent concepts of maps, one-regular graphs and 1 2-transitive group actions on graphs of valency 4 is...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Comb. Theory, Ser. B

دوره 98  شماره 

صفحات  -

تاریخ انتشار 2008